Computational complexity theory - PDFSEARCH.IO - Document Search Engine

Computational complexity theory
Results: 2049

#	Item
841	The tree machine? Arnaud Spiwack MINES ParisTech Abstract. A variant of Turing machines is introduced where the tape Add to Reading List Source URL: www.cri.ensmp.fr Language: English - Date: 2015-02-19 09:03:36 Mathematics Computability theory Formal methods Turing machine Random access machine Computational complexity theory Algorithm Lambda calculus FO Theory of computation Models of computation Theoretical computer science
842	Multiplicative approximations of random walk transition probabilities Michael Kapralov∗ Rina Panigrahy† June 17, 2011 Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2014-12-09 10:13:50 Analysis of algorithms Probabilistic complexity theory Randomized algorithm Connectivity Random walk NP-complete problems Algebraic graph theory Centrality Tutte polynomial Theoretical computer science Computational complexity theory Mathematics
843	Survey on Cryptographic Obfuscation M´at´e Horv´ath∗ Laboratory of Cryptography and System Security (CrySyS Lab)† April 24, 2015 Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2015-04-24 07:02:48 Complexity classes Obfuscation Circuit complexity Obfuscated code Ciphertext indistinguishability International Obfuscated C Code Contest NC Semantic security Multilinear map Theoretical computer science Computer programming Computational complexity theory
844	Curriculum Vitae of Uriel Feige Contact Information Department of Computer Science and Applied Mathematics The Weizmann Institute of Science Rehovot 76100, ISRAEL Phones (office), (cell) Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2015-01-01 11:38:31 Computational complexity theory Complexity classes Approximation algorithm NP-complete ACM SIGACT European Symposium on Algorithms International Colloquium on Automata Languages and Programming Uriel Feige Algorithm Theoretical computer science Applied mathematics Computer science
845	An extended abstract of this paper appears in the proceedings of the 11th ACM Conference on Computer and Communications Security—CCS 2004, Washington, DC, OctoberThis expanded version is available from the IACR Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2004-12-15 15:22:16 Computational complexity theory Coding theory Randomness Randomness extractor Extractor Advantage Ciphertext indistinguishability Leftover hash lemma Adversary model Cryptography Theoretical computer science Applied mathematics
846	AN OBSERVATION ABOUT VARIATIONS OF THE DIFFIE-HELLMAN ASSUMPTION R. BHASKAR, K. CHANDRASEKARAN, S. LOKAM, P.L. MONTGOMERY, R. VENKATESAN, AND Y. YACOBI Abstract. We generalize the Strong Boneh-Boyen (SBB) signature sche Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2008-12-16 15:26:16 Finite fields Computability theory Alan Turing Turing reduction Reduction Diffie–Hellman problem Theoretical computer science Applied mathematics Computational complexity theory
847	Algebraic Algorithms for LWE Martin R. Albrecht1 , Carlos Cid1 , Jean-Charles Faug`ere2 , and Ludovic Perret2 1 Information Security Group Royal Holloway, University of London Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2015-02-26 10:18:21 Applied mathematics Normal distribution Learning with errors Algebraic geometry Regular language Computational complexity theory Ideal lattice cryptography Cryptography Mathematics Theoretical computer science
848	Constant-Round Concurrent Zero-knowledge from Indistinguishability Obfuscation Kai-Min Chung∗ Huijia Lin† Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2014-12-18 08:37:34 Complexity classes Cryptographic protocols Zero-knowledge proof Interactive proof system Soundness NP IP Commitment scheme P/poly Theoretical computer science Computational complexity theory Cryptography
849	REDEFINING RANDOMNESS QUANTIS WHEN RANDOM NUMBERS CANNOT BE LEFT TO CHANCE Add to Reading List Source URL: www.idquantique.com Language: English - Date: 2015-03-23 10:17:13 Theoretical computer science Randomness Computational complexity theory Philosophy of thermal and statistical physics Min-entropy Randomness extractor Leftover hash lemma Entropy Random number generation Information theory Applied mathematics Cryptography
850	Chapter 5: Hard Problems Quotation Algorithmic Adventures From Knowledge to Magic Add to Reading List Source URL: www.win.tue.nl Language: English - Date: 2011-10-24 15:11:43 Complexity classes Dynamic programming NP-complete problems Operations research P versus NP problem Time complexity Knapsack problem P Subset sum problem Theoretical computer science Computational complexity theory Applied mathematics